On Weak Maps of Ternary Matroids
نویسندگان
چکیده
Let M and N be ternary matroids having the same rank and the same ground set, and assume that every independent set in N is also independent in M . The main result of this paper proves that if M is 3-connected and N is connected and non-binary, then M = N . A related result characterizes precisely when a matroid that is obtained by relaxing a circuit-hyperplane of a ternary matroid is also ternary.
منابع مشابه
On the decomposition of ternary matroids
Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Matroids generalize linear dependence over vector spaces, and they also abstract the properties of graphs, in the former case they are called Vector Matroids, in the latter they are called Graphic Matroids [3]. The operation of Matroid Union was introduced by Nash-Williams in 1966. A matroid is i...
متن کاملOn the Excluded Minors for the Matroids That Are Either Binary or Ternary
The classes of binary and ternary matroids are both relatively well understood as is their intersection, the class of regular matroids. This paper considers the union M of the classes of binary and ternary matroids. M is a minor-closed class and the focus of the paper is on determining its set of excluded minors. It is conjectured here that this set of excluded minors unique matroids that are o...
متن کاملThe excluded minors for the class of matroids that are binary or ternary
We show that the excluded minors for the class of matroids that are binary or ternary are U2,5, U3,5, U2,4⊕F7, U2,4⊕F ∗ 7 , U2,4⊕2F7, U2,4 ⊕2 F ∗ 7 , and the unique matroids obtained by relaxing a circuithyperplane in either AG(3, 2) or T12. The proof makes essential use of results obtained by Truemper on the structure of almost-regular matroids.
متن کاملA Modular Triple Characterization of Lifting Signatures, Weak Orientations, Orientations, and Ternary Signatures of Matroids
For a matroid M , Dowling and Kelly show how to use a special class of its circuits, which we call balanced circuits, to construct a lift of M. In the case where M comes from a graph, Zaslavsky defines balanced circuits in terms of gains, which are group elements that label the edges of the graph. I will use gains to define the balanced circuits of an arbitrary matroid and show that the lift co...
متن کاملOn Representable Matroids Having Neither U2,5– Nor U3,5–minors
Consider 3–connected matroids that are neither binary nor ternary and have neither U2,5– nor U3,5–minors: for example, AG(3, 2)′, the matroid obtained by relaxing a circuit-hyperplane of AG(3, 2). The main result of the paper shows that no matroid of this sort is representable over any field. This result makes it possible to extend known characterisations of the binary and ternary matroids repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 1998